Post grammars as a programming language description tool

Natural Language Agreement Description for Reversible Grammars

The paper presents a very general method to describe the agreement in the natural languages. The method can be used in automatic translation. It allows the analysis of a text and then the generation of the text in target language so it can be embeded in the reversible grammars. It allows also in the case of analysis the treatment of the agreement errors. The method is based on a set of simple e...

Ambiguity Detection for Programming Language Grammars

Detecting Ambiguity in Programming Language Grammars

Ambiguous Context Free Grammars (CFGs) are problematic for programming languages, as they allow inputs to be parsed in more than one way. In this paper, we introduce a simple non-deterministic search-based approach to ambiguity detection which non-exhaustively explores a grammar in breadth for ambiguity. We also introduce two new techniques for generating random grammars – Boltzmann sampling an...

Modular grammars for programming language prototyping

Attribute grammars as a functional programming paradigm

The purpose of this paper is twofold. Firstly we show how attributes in an attribute grammar can be simply and efficiently evaluated using a lazy functional language. The class of attribute grammars we can deal with are the most general ones possible: attributes may depend on each other in an arbitrary way, as long as there are no truly circular data dependencies. Secondly, we describe a method...